Kripke Semantics for Intersection Formulas
نویسندگان
چکیده
We propose a notion of the Kripke-style model for intersection logic. Using game interpretation, we prove soundness and completeness proposed semantics. In other words, formula is provable (a type inhabited) if only it forced in every model. As by-product, obtain another proof normalization Barendregt–Coppo–Dezani assignment system.
منابع مشابه
Kripke semantics for fuzzy logics
Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the Basic Logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models...
متن کاملA Distributed Kripke Semantics
A. An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible Kripke state with a set of places, and show that this semantics is both sound and complete for the logic. In the semantics, resources of a distributed system are interpreted as atoms, and pl...
متن کاملAbstract Kripke Semantics
Kripke Semantics Yanjing Wang (Amsterdam) In this paper, we give a schema of non-standard Kripke semantics for modal logic, in which the meaning of a modality in a formula depends on the evaluation process of that formula. More precisely, in our semantics schema, the truth condition for a sub-formula [] A of B depends on the path of worlds we passed in the evaluation of B and the position of []...
متن کاملMessage-generated Kripke semantics
We show how to generate multi-agent Kripke models from message exchanges. With these models we can analyze the epistemic consequences of a message exchange. One novelty in this approach is that we include the messages in our logical language. This allows us to model messages that mention other messages and agents that reason about messages. Our framework can be used to model a wide range of dif...
متن کاملKripke Semantics for Basic Sequent Systems
We present a general method for providing Kripke semantics for the family of fully-structural multiple-conclusion propositional sequent systems. In particular, many well-known Kripke semantics for a variety of logics are easily obtained as special cases. This semantics is then used to obtain semantic characterizations of analytic sequent systems of this type, as well as of those admitting cut-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2021
ISSN: ['1557-945X', '1529-3785']
DOI: https://doi.org/10.1145/3453481